Combinatorial Disambiguation
نویسنده
چکیده
The disambiguation of sentences is a combinatorial problem. This paper describes a method for treating it as such, directly, by adapting standard combinatorial search optimizations. Traditional disambiguation heu-ristics are applied but, instead of being embedded in individual decision procedures for specific types of ambiguities, they contribute to numerical weights that are considered by a single global optimizer. The result is increased power and simpler code. The method is being implemented for a machine translation projecl, but could be adapted to any natural language system.
منابع مشابه
A Preferential Constraint Satisfaction Technique for Natural Language Analysis
In this paper, we present a new technique for the semantic analysis of sentences, including an ambiguity-packing method that generates a packed representation of individual syntactic and semantic structures. This representation is based on a dependency structure with constraints that must be satised in the syntax-semantics mapping phase. Complete syntax-semantics mapping is not performed until ...
متن کاملAn Implementation of Incremental Disambiguation with Conceptual Hierarchy
Word sense ambiguity is one of the most important problems of natural language semantic interpretation. In traditional method, there is a combinatorial explosion problem due to the fact that the propriety of each word sense of an ambiguous word is independently checked with each word sense of other ambiguous words during the disambiguation process. In this paper, we describe an `incremental sem...
متن کاملD-Bees: A Novel Method Inspired by Bee Colony Optimization for Solving Word Sense Disambiguation
Word sense disambiguation (WSD) is a problem in the field of computational linguistics given as finding the intended sense of a word (or a set of words) when it is activated within a certain context. WSD was recently addressed as a combinatorial optimization problem in which the goal is to find a sequence of senses that maximize the semantic relatedness among the target words. In this article, ...
متن کاملWord Sense Disambiguation Using an Evolutionary Approach
Word sense disambiguation is a combinatorial problem consisting in the computational assignment of a meaning to a word according to a particular context in which it occurs. Many natural language processing applications, such as machine translation, information retrieval, and information extraction, require this task which occurs at the semantic level. Evolutionary computation approaches can be ...
متن کاملAn Optimized Combinatorial Approach of Learning Algorithm for Word Sense Disambiguation
Word sense disambiguation is the process to find best sense of ambiguous word from the existing senses to remove the ambiguity. This thesis work is an attempt to optimize the word sense disambiguation method. Most commonly supervised machine learning algorithms were used to solve this problem and improve the performance. Some attempts were made to use unsupervised machine learning algorithms al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988